NAS Experiences of Porting CM Fortran Codes to HPF on IBM SP2 and SGI Power Challenge
نویسنده
چکیده
Current Connection Machine (CM) Fortran codes developed for the CM-2 and the CM-5 represent an important class of parallel applications. Several users have employed CM Fortran codes in production mode on the CM-2 and the CM-5 for the last five to six years, constituting a heavy investment in terms of cost and time. With Thinking Machines Corporation’s decision to withdraw from the hardware business and with the decommissioning of many CM-2 and CM-5 machines, the best way to protect the substantial investment in CM Fortran codes is to port the codes to High Performance Fortran (HPF) on highly parallel systems. HPF is very similar to CM Fortran and thus represents a natural transition. Conversion issues involved in porting CM Fortran codes on the CM-5 to HPF are presented. Several CM Fortran codes have been ported to Subset HPF on the IBM SP2 and the SGI Power Challenge. Speedup ratios versus number of processors for the Linear solver and DSMC code are presented
منابع مشابه
NAS Experiences of Porting CM Fortran Codes to on IBM SP2 and SGI Power Challenge
Current Connection Machine (CM) Fortran codes developed for the CM-2 and the CM-5 represent an important class of parallel applications. Several users have employed CM Fortran codes in production mode on the CM-2 and the CM-5 for the last five to six years, constituting a heavy investment in terms of cost and time. With Thinking Machines Corporation's decision to withdraw from the hardware busi...
متن کاملHPFStab: An HPF Conjugate Gradient Library
In this paper we present a case study of porting of a Conjugate Gradient library from CM Fortran on a Connection Machine 5 to High Performance Fortran (HPF) on a Silicon Graphics Power Challenge, addressing the issues of portability and performance. Conjugate Gradient Methods (CGM) are a broad category of linear algebra methods for solving the generalized equation A x= b. Through the process of...
متن کاملImplementation of NAS Parallel Benchmarks in High Performance Fortran
We present an HPF implementation of BT, SP, LU, FT, CG and MG of the NPB2.3-serial benchmark set. The implementation is based on HPF performance model of the benchmark specific primitive operations with distributed arrays. We present profiling and performance data on SGI Origin 2000 and compare the results with NPB2.3. We discuss advantages and limitations of HPF and pghpf com-
متن کاملExperiences on Parallelizing Compilation for Development and Porting of Large Scale Applications on Distributed Memory Parallel Systems∗
High level environment, such as High Performance Fortran (HPF), supporting the development of parallel applications and porting of legacy codes to parallel architectures have not yet gained a broad acceptance and diffusion. Common objections claim difficulty of performance tuning, limitation of its application to regular, data parallel computations, and lack of robustness of parallelizing HPF c...
متن کاملAn Evaluation of High Performance Fortran Compilers Using the HPFBench Benchmark Suite
The High Performance Fortran (HPF) benchmark suite HPFBench was designed for evaluating the HPF language and compilers on scalable architectures. The functionality of the benchmarks covers scientific software library functions and application kernels. In this paper, we report on an evaluation of two commercial HPF compilers, namely, xlhpf from IBM and pghpf from PGI, on an IBM SP2 using the lin...
متن کامل